On the Complexity to Approach Optimum Solutions by Inhomogeneous Markov Chains
نویسنده
چکیده
We analyse the probability 1 − δ to be in an optimum solution after k steps of an inhomogeneous Markov chain which is specified by a logarithmic cooling schedule c(k) = Γ/ ln (k + 2). We prove that after k > (n/δ) ) steps the probability to be in an optimum solution is larger than 1 − δ, where n is an upper bound for the size of local neighbourhoods and Γ is a parameter of the entire configuration space. By counting the occurrences of configurations, we demonstrate for an application with known optimum solutions that the lower bound indeed ensures the stated probability for a relatively small constant in O(Γ ).
منابع مشابه
Stochastic Dynamic Programming with Markov Chains for Optimal Sustainable Control of the Forest Sector with Continuous Cover Forestry
We present a stochastic dynamic programming approach with Markov chains for optimal control of the forest sector. The forest is managed via continuous cover forestry and the complete system is sustainable. Forest industry production, logistic solutions and harvest levels are optimized based on the sequentially revealed states of the markets. Adaptive full system optimization is necessary for co...
متن کاملEvaluation of First and Second Markov Chains Sensitivity and Specificity as Statistical Approach for Prediction of Sequences of Genes in Virus Double Strand DNA Genomes
Growing amount of information on biological sequences has made application of statistical approaches necessary for modeling and estimation of their functions. In this paper, sensitivity and specificity of the first and second Markov chains for prediction of genes was evaluated using the complete double stranded DNA virus. There were two approaches for prediction of each Markov Model parameter,...
متن کاملProduct Form Approximation of Transient Probabilities in Stochastic Reaction Networks
Most Markov chains that describe networks of stochastic reactions have a huge state space. This makes exact analysis infeasible and hence the only viable approach, apart from simulation, is approximation. In this paper we derive a product form approximation for the transient probabilities of such Markov chains. The approximation can be interpreted as a set of interacting time inhomogeneous Mark...
متن کاملFinancial Risk Modeling with Markova Chain
Investors use different approaches to select optimal portfolio. so, Optimal investment choices according to return can be interpreted in different models. The traditional approach to allocate portfolio selection called a mean - variance explains. Another approach is Markov chain. Markov chain is a random process without memory. This means that the conditional probability distribution of the nex...
متن کاملA Bayesian Networks Approach to Reliability Analysis of a Launch Vehicle Liquid Propellant Engine
This paper presents an extension of Bayesian networks (BN) applied to reliability analysis of an open gas generator cycle Liquid propellant engine (OGLE) of launch vehicles. There are several methods for system reliability analysis such as RBD, FTA, FMEA, Markov Chains, and etc. But for complex systems such as LV, they are not all efficiently applicable due to failure dependencies between compo...
متن کامل